On -irregularity strength of ladders and fan graphs
نویسندگان
چکیده
منابع مشابه
On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کامل240 on Graphs of Irregularity Strength 2
We consider undirected graphs without loops or multiple edges. A weighting of a graph G is an assignment of a positive integer w( e) to each edge of G. For a vertex x€V(G), the (weighted) degree d(x) is the sum ofweights on the edges ofG incident to x. The irregularity strength s( G) of a graph G was introduced by Chartrand et al. in [1] a.s the minimum integer t such that G has a weighting wit...
متن کاملIrregularity strength of dense graphs
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) → {1, 2, . . . , w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct. The smallest w for which there exists an irregular assignment on G is called the irreg...
متن کاملOn total vertex irregularity strength of graphs
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
متن کاملIrregularity Strength of Regular Graphs
Let G be a simple graph with no isolated edges and at most one isolated vertex. For a positive integer w, a w-weighting of G is a map f : E(G) → {1, 2, . . . , w}. An irregularity strength of G, s(G), is the smallest w such that there is a w-weighting of G for which ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2019.04.002